On temporal program verification rules
نویسندگان
چکیده
منابع مشابه
Verification and Validation of Temporal Business Rules
In this paper the development of an analysis tool for verification and validation of temporal business rules is described. The formalism for expressing the business rules is the Conceptual Rule Language developed as part for the ESPRIT II project TEMPORA.
متن کاملMining Temporal Rules from Program Execution Traces
Software evolution incurs difficulties in program comprehension and software verification, and hence increases the cost of software maintenance. In this study, we propose a novel technique, to mine from program execution traces a sound and complete set of statistically significant temporal rules of arbitrary lengths. The extracted temporal rules reveal invariants that the program observes, and ...
متن کاملAutomatically Discovering Temporal Properties for Program Verification
This paper reports on our experience using a dynamic analysis tool, Terracotta, to automatically infer temporal properties, and a model checker, Java PathFinder, to check the inferred properties. To our best knowledge, this is the first experiment using a model checker to check automatically inferred properties. We introduce two key ideas to make our approach effective. First, we develop techni...
متن کاملProgram Verification using Constraint Handling Rules and Array Constraint Generalizations
The transformation of constraint logic programs (CLP programs) has been shown to be an effective methodology for verifying properties of imperative programs. By following this methodology, we encode the negation of a partial correctness property of an imperative program prog as a predicate incorrect defined by a CLP program P , and we show that prog is correct by transforming P into the empty p...
متن کاملTemporal Property Verification as a Program Analysis Task
We describe a reduction from temporal property verification to a program analysis problem. We produce an encoding which, with the use of recursion and nondeterminism, enables off-the-shelf program analysis tools to naturally perform the reasoning necessary for proving temporal properties (e.g. backtracking, eventuality checking, tree counterexamples for branching-time properties, abstraction re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO. Informatique théorique
سال: 1985
ISSN: 0399-0540
DOI: 10.1051/ita/1985190302611